Granular Computing on Binary Relations II Rough Set Representations and Belief Functions
نویسنده
چکیده
منابع مشابه
Granular Computing and Rough Sets - An Incremental Development
Granulation and partition are examined in parallel from the rough set prospect. The table representations and concept hierarchy tree for partitions are set theoretical, but become topological for granulations. Here topology means the binary neighborhood system pre-topology defined by binary relations.
متن کاملA Model of Granular Computing on Binary Relations Based on Generalized Rough Set and Its Granulation in Information System
Granular computing is a new information processing method. Many models and methods of granular computing have been proposed and studied. Nowadays, the granular computing has been appeared in many areas of information processing. In this paper, a study of the model of granular computing on Binary Relations based on Generalized Rough Set is presented. We hope to expand the range of application of...
متن کاملTOPOLOGICAL SIMILARITY OF L-RELATIONS
$L$-fuzzy rough sets are extensions of the classical rough sets by relaxing theequivalence relations to $L$-relations. The topological structures induced by$L$-fuzzy rough sets have opened up the way for applications of topological factsand methods in granular computing. In this paper, we firstly prove thateach arbitrary $L$-relation can generate an Alexandrov $L$-topology.Based on this fact, w...
متن کاملCovering-based Granular Computing
In this lecture, binary granular computing (granular computing on binary relations) is re-examined. Two definitions for approximations in Rough Set Theory (one is from equivalence relation and the other from point-based topology view) were no longer equal under binary relation, the latter will have the better performance, especially when the universe is infinite. However, the point-based defini...
متن کاملGranular Computing Based on Rough Sets, Quotient Space Theory, and Belief Functions
A model of granular computing (GrC) is proposed by reformulating, re-interpreting, and combining results from rough sets, quotient space theory, and belief functions. Two operations, called zoomingin and zooming-out operations, are used to study connections between the elements of a universe and the elements of a granulated universe, as well as connections between computations in the two univer...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998